Existence and Life Span of Periodic Solutions for the First Order Quasilinear Hyperbolic Equations

g1.IntroductionWeconsiderthefollowingfirstorderquasilinearhyperbolicequationswithinternaIdissipa-tlveterm:U, A(U)U. F(U)=o(1.1)whereUeR2isunknownvectorfunction,A(U)is2X2knownsmoothmatrix,F(U)is2X2knownsmoothvectorfunction.Itiswell-knownthatCauchyproblemoftheequations(l.1)hasbeenwidelystudied(Ll-6J),however,theequations(l.1)withperiedicinitialdatahasbeenhardlystudiedandonesfindthatitiscomplicatedforproblemwithperiodicinitialdata.Becausetheperiodicdis-turbanceLlirectlyinfluencesthebounde…     

The Existence of Periodic Orbits for Higher Dimensional Autonomous Systemswith Small Perturbations

ＴｈｅＥｘｉｓｔｅｎｃｅｏｆＰｅｒｉｏｄｉｃＯｒｂｉｔｓｆｏｒＨｉｇｈｅｒＤｉｍｅｎｓｉｏｎａｌＡｕｔｏｎｏｍｏｕｓＳｙｓｔｅｍｓｗｉｔｈＳｍａｌｌＰｅｒｔｕｒｂａｔｉｏｎｓＪｉａｎｇＬｉｑｉｎｇ（蒋里强）；ＺｈｏｕＹｉ（周毅）；ＦａｎＹｅ（范晔）（...     

Wave-vector diagrams for two-dimensional photonic crystals

Photonic crystals exhibit band gaps, meaning that electromagnetic fields cannot propagate in them for specific ranges of wavelengths and directions. The calculation of band structure diagrams has been intensively studied and is now well understood. In contrast to that, so-called wave-vector diagrams (i.e. dispersion surfaces, depicting the loci of all relevant wave vectors at a fixed wavelength) are less known and used. In principle, they show how the effective index of the structure depends on the direction of propagation. A method to calculate explicitly wave-vector diagrams for two-dimensional photonic crystals is derived which leads finally to quadratic eigenvalue problems. Results for square and triangular lattices are presented and some applications are discussed.     

M/G/1/N vacation model with varying E-limited service discipline

We define and analyze anM/G/1/N vacation model that uses a service discipline that we call theE-limited with limit variation discipline. According to this discipline, the server provides service until either the system is emptied (i.e. exhausted) or a randomly chosen limit ofl customers has been served. The server then goes on a vacation before returning to service the queue again. The queue length distribution and the Laplace-Stieltjes transforms of the waiting time, busy period and cycle time distributions are found. Further, an expression for the mean waiting time is developed. Several previously analyzed service disciplines, including Bernoulli scheduling, nonexhaustive service and limited service, are special cases of the general varying limit discipline that is analyzed in this paper.     

Cyclic reduction and FACR methods for piecewise hermite bicubic orthogonal spline collocation

Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N ²log₂ N) andO(N ²log₂log₂ N) arithmetic operations, respectively.     

On operators and search space topology in multi-objective flow shop scheduling

Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce.     

工件带到达时间的两阶段柔性流水作业的近似算法

研究了工件带到时间的两阶段柔性流水作业的排序问题,基于求解流水作业和平行机问题的算法思想,提出两个相应的近似算法H(R)和H(MR(?)),证明了这两个算法的最坏情况性能比分别为3-1/m和2/5-1/m,讨论了界的紧性,并利用数值模拟以分析算法与最优值的近似性能比.     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.     

A web-based workforce management system for Sainsburys Supermarkets Ltd

Labour scheduling plays an important and critical role in Sainsburys day to day operations and profitability. The integrated workforce management solution for Sainsburys is an intelligent solution for the operational deployment of human resources, integrated business forecasting, generation and calculation of workload and staff scheduling. The workforce management technology has provided Sainsburys with a fully web-based and centralised system that produces optimised schedules for all employees satisfying the forecasted demand of work with granularity of fifteen minutes. The system is configured to respect all operational and business requirements as well as employee contractual constraints. This paper introduces the workforce management solution system designed, developed and implemented for Sainsburys. We concentrate on two modelling structures, namely the work pattern model and optimisation model, and briefly discuss the optimisation process.